Hurst exponent based approach for influence maximization in social networks
نویسندگان
چکیده
منابع مشابه
Stigmergy-Based Influence Maximization in Social Networks
Influence maximization is an important research topic which has been extensively studied in various fields. In this paper, a stigmergybased approach has been proposed to tackle the influence maximization problem. We modelled the influence propagation process as ant’s crawling behaviours, and their communications rely on a kind of biological chemicals, i.e., pheromone. The amount of the pheromon...
متن کاملSimulated Annealing Based Influence Maximization in Social Networks
The problem of influence maximization, i.e., mining top-k influential nodes from a social network such that the spread of influence in the network is maximized, is NP-hard. Most of the existing algorithms for the problem are based on greedy algorithm. Although greedy algorithm can achieve a good approximation, it is computational expensive. In this paper, we propose a totally different approach...
متن کاملIncentive Compatible Influence Maximization in Social Networks
Information diffusion and influence maximization in social networks are well studied problems and various models and algorithms have been proposed. The main assumption in these studies is that the influence probabilities are known to the social planner. The influence probabilities, however can vary significantly with the type of the information and the time at which the information is propagati...
متن کاملInfluence Maximization in Human-Intervened Social Networks
Recently there has been tremendous research on influence analysis in social networks: how to find initial topics or users to maximize the word-of-mouth effect that may be significant for advertising, viral marketing and other applications. Many researchers focus on the problem of influence maximization on the static structure of the network and find a subset of early adopters which activate the...
متن کاملTime-sensitive influence maximization in social networks
One of the fundamental issues in social networks is the influence maximization problem, where the goal is to identify a small subset of individuals such that they can trigger the largest number of members in the network. In real-world social networks, the propagation of information from a node to another may incur a certain amount of time delay; moreover, the value of information may decrease o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of King Saud University - Computer and Information Sciences
سال: 2019
ISSN: 1319-1578
DOI: 10.1016/j.jksuci.2019.12.010